Computing the Writhing Number of a Polygonal Knot
نویسندگان
چکیده
منابع مشابه
The writhing number of a space curve.
A geometric invariant of a space curve, the writhing number, is defined and studied. For the central curve of a twisted cord the writhing number measures the extent to which coiling of the central curve has relieved local twisting of the cord. This study originated in response to questions that arise in the study of supercoiled double-stranded DNA rings.
متن کاملMonte Carlo Explorations of Polygonal Knot Spaces
Polygonal knots are embeddings of polygons in three space. For each n, the collection of embedded n-gons determines a subset of Euclidean space whose structure is the subject of this paper. Which knots can be constructed with a specified number of edges? What is the likelihood that a randomly chosen polygon of n-edges will be a knot of a specific topological type? At what point is a given topol...
متن کاملUniversal Characteristics of Polygonal Knot Probabilities
There is a striking qualitative similarity among the graphs of the relative probabilities of corresponding knot types across a wide range of random polygon models. In many cases one has theoretical results describing the asymptotic decay of these knot probabilities but, in the finite range, there is little theoretical knowledge and a variety of functional models have been used to fit the observ...
متن کاملThe Forbidden Number of a Knot
Every classical or virtual knot is equivalent to the unknot via a sequence of extended Reidemeister moves and the so-called forbidden moves. The minimum number of forbidden moves necessary to unknot a given knot is an invariant we call the forbidden number. We relate the forbidden number to several known invariants, and calculate bounds for some classes of virtual knots.
متن کاملThe slicing number of a knot
An open question asks if every knot of 4–genus gs can be changed into a slice knot by gs crossing changes. A counterexample is given. AMS Classification 57M25; 57N70
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2004
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-004-2864-x